home *** CD-ROM | disk | FTP | other *** search
- Path: rap.SanDiegoCA.ATTGIS.COM!es013!jbc
- From: jbc@ElSegundoCA.ATTGIS.COM (Jim Chapman)
- Newsgroups: comp.lang.c++
- Subject: Re: Sedgewick red-black trees
- Date: 22 Jan 1996 20:08:10 GMT
- Organization: AT&T Global Information Solutions
- Distribution: world
- Message-ID: <4e0qra$73b@rap.SanDiegoCA.ATTGIS.COM>
- References: <4dn9v7$gl@news.halcyon.com>
- Reply-To: jbc@ElSegundoCA.ATTGIS.COM
- NNTP-Posting-Host: es013.elsegundoca.attgis.com
-
- In article gl@news.halcyon.com, normanb@halcyon.com (Norm Bryar) writes:
- > Greetings all;
- >
- > Has anyone fleshed out Robert Sedgewick's red-black tree
- > implementation? Chap 15 of "Algorithms in C++" has compact, elegant
- > code for insertion and searching into a balanced, red-black tree, but
- > it seems to be missing the code for how to delete a node!
- > Thanks much.
- > --Norm
- >
-
- The HP STL (Stepanov/Lee) implementation uses red-black trees for
- associative containers. You might want to take a look at that. The
- source is widely available.
-
- Regards,
- Jim Chapman
- jbc@ElSegundoCA.ncr.com
-
-